Data structure for representing a graph: combination of linked list and hash table
نویسنده
چکیده
In this article we discuss a data structure, which combines advantages of two different ways for representing graphs: adjacency matrix and collection of adjacency lists. This data structure can fast add and search edges (advantages of adjacency matrix), use linear amount of memory, let to obtain adjacency list for certain vertex (advantages of collection of adjacency lists). Basic knowledge of linked lists and hash tables is required to understand this article. The article contains examples of implementation on Java.
منابع مشابه
Algorithms and data structures for graph analysis
Introduction Software implementations for graph structures can represent a graph as an adjacency list or a sparse adjacency matrix. There are no standards regarding the implementation details of adjacency list or adjacency matrix structures. Notable parties propose different implementations for adjacency lists [1]. Guido van Rossum suggests using a hash table with arrays, where the arrays indic...
متن کاملGeometric Data Structures for Games: Index Structures
Index Structures: We continue our discussion of useful geometric data structure for computer games. So far we have discussed data structures for representing meshes (and more generally, cell complexes), geometric graphs (such as the visibility graph, θ-graph), and spatial subdivisions (such as the Delaunay triangulation). Usually, when we think of data structures for 1-dimensional data (such as...
متن کاملFast Integer Search
This paper explores the design and implementation of the Fast Integer Search (FIS) algorithm. We discuss work previously done on the topic of integer searches and then present our own solution to this problem. Our solution uses a combination of existing data structures; the trie, the linked list and the hash table in an attempt to achieve a running time of better than O(lg n). We show our imple...
متن کاملAn Efficient Implementation of Max Tree with Linked List and Hash Table
The max tree is a multi-scale image representation based in mathematical morphology which has been applied to image filtering, segmentation, tracking and information retrieval. This paper considers the problem of efficiently building max tree structures from images and retrieving information from them. Our aim is to find an economical data structure that provides fast direct access to the max t...
متن کاملIndexing Information for Data Forensics
We introduce novel techniques for organizing the indexing structures of how data is stored so that alterations from an original version can be detected and the changed values specifically identified. We give forensic constructions for several fundamental data structures, including arrays, linked lists, binary search trees, skip lists, and hash tables. Some of our constructions are based on a ne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0908.3089 شماره
صفحات -
تاریخ انتشار 2009